The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems

We determine the power of weighted sum scalarization with respect to computation approximations for general multiobjective minimization and maximization problems. Additionally, we introduce a new multi-factor notion approximation that is specifically tailored case its inherent trade-offs between different objectives. For problems, provide an efficient algorithm computes problem by using exact or approximate scalarization. In used, this comes arbitrarily close best quality obtainable supported solutions - both common notion. Moreover, yields currently results several well-known however, show polynomial guarantee can, in general, not be obtained more than one objective functions simultaneously solutions.